Algorithms for the restriction-site mapping of DNA molecules.
نویسندگان
چکیده
منابع مشابه
Algorithms for the restriction-site mapping of DNA molecules.
Two algorithms are described that rapidly construct restriction maps of DNA molecules from single- and double-digest data. The implementation of these algorithms into the Pascal programs AMAPK and AMARD allows such mapping to be done on microcomputers.
متن کاملPhylogenetics in Clarkia (Onagraceae): Restriction Site Mapping of Chloroplast DNA
Restriction site maps of chloroplast DNA (cpDNA), maternally inherited in Clarkia, were obtained in representative species of all seven diploid sections, the allotetraploid sect. Clarkia, and the outgroup Epilobium brachycarpum. CpDNA restriction site variation was analyzed by Wagner and Dollo parsimony, bootstrapping, and genetic distance methods. Four shortest Wagner trees, one of which was a...
متن کاملOptical mapping of site-directed cleavages on single DNA molecules by the RecA-assisted restriction endonuclease technique.
Fluorescence in situ hybridization (FISH) resolution has advanced because newer techniques use increasingly decondensed chromatin. FISH cannot analyze restriction enzyme cutting sites due to limitations of the hybridization and detection technologies. The RecA-assisted restriction endonuclease (RARE) technique cleaves chromosomal DNA at a single EcoRI site within a given gene or selected sequen...
متن کاملA new method for straightening DNA molecules for optical restriction mapping.
We have developed an improved method of straightening DNA molecules for use in optical restriction mapping. The DNA was straightened on 3-aminopropyltriethoxysilane-coated glass slides using surface tension generated by a moving meniscus. In our method the meniscus motion was controlled mechanically, which provides advantages of speed and uniformity of the straightened molecules. Variation in t...
متن کاملRestriction site mapping is in separation theory
A computer algorithm for restriction-site mapping consists of a generator of partial maps and a consistency checker. This paper examines consistency checking and argues that a method based on separation theory extracts the maximum amount of information from fragment lengths in digest data. It results in the minimum number of false maps being generated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1988
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.85.19.7298